43 research outputs found

    Maximal Tukey types, P-ideals and the weak Rudin-Keisler order

    Full text link
    In this paper, we study some new examples of ideals on Ο‰\omega with maximal Tukey type (that is, maximal among partial orders of size continuum). This discussion segues into an examination of a refinement of the Tukey order -- known as the "weak Rudin-Keisler order" -- and its structure when restricted to these ideals of maximal Tukey type. Mirroring a result of Fremlin on the Tukey order, we also show that there is an analytic P-ideal above all other analytic P-ideals in the weak Rudin-Keisler.Comment: 17 page

    Classifying the Arithmetical Complexity of Teaching Models

    Full text link
    This paper classifies the complexity of various teaching models by their position in the arithmetical hierarchy. In particular, we determine the arithmetical complexity of the index sets of the following classes: (1) the class of uniformly r.e. families with finite teaching dimension, and (2) the class of uniformly r.e. families with finite positive recursive teaching dimension witnessed by a uniformly r.e. teaching sequence. We also derive the arithmetical complexity of several other decision problems in teaching, such as the problem of deciding, given an effective coding {L0,L1,L2,…}\{\mathcal L_0,\mathcal L_1,\mathcal L_2,\ldots\} of all uniformly r.e. families, any ee such that Le={L0e,L1e,…,}\mathcal L_e = \{L^e_0,L^e_1,\ldots,\}, any ii and dd, whether or not the teaching dimension of LieL^e_i with respect to Le\mathcal L_e is upper bounded by dd.Comment: 15 pages in International Conference on Algorithmic Learning Theory, 201
    corecore